0.04/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.14	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.14/0.35	% Computer   : n027.cluster.edu
0.14/0.35	% Model      : x86_64 x86_64
0.14/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.35	% Memory     : 8042.1875MB
0.14/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.36	% CPULimit   : 1200
0.14/0.36	% WCLimit    : 120
0.14/0.36	% DateTime   : Tue Jul 13 15:26:55 EDT 2021
0.14/0.36	% CPUTime    : 
0.14/0.36	% Number of cores: 8
0.14/0.36	% Python version: Python 3.6.8
0.14/0.36	# Version: 2.6rc1-ho
0.14/0.36	# No SInE strategy applied
0.14/0.36	# Trying AutoSched0 for 59 seconds
0.39/0.61	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S088N
0.39/0.61	# and selection function SelectCQArNTEqFirstUnlessPDom.
0.39/0.61	#
0.39/0.61	# Preprocessing time       : 0.030 s
0.39/0.61	# Presaturation interreduction done
0.39/0.61	
0.39/0.61	# Proof found!
0.39/0.61	# SZS status Theorem
0.39/0.61	# SZS output start CNFRefutation
0.39/0.61	thf(dpsetconstrERa, conjecture, ((setukpairinjL=>(setukpairinjR=>![X1:$i, X7:$i, X9:$i > $i > $o, X3:$i]:(in @ X3 @ X1=>![X4:$i]:(in @ X4 @ X7=>(in @ (kpair @ X3 @ X4) @ (dpsetconstr @ X1 @ X7 @ (^[X5:$i, X6:$i]:X9 @ X5 @ X6))=>X9 @ X3 @ X4)))))<=dsetconstrER), file('/export/starexec/sandbox/benchmark/theBenchmark.p', dpsetconstrERa)).
0.39/0.61	thf(dsetconstrER, axiom, (dsetconstrER<=>![X1:$i, X2:$i > $o, X3:$i]:(in @ X3 @ (dsetconstr @ X1 @ (^[X4:$i]:X2 @ X4))=>X2 @ X3)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', dsetconstrER)).
0.39/0.61	thf(setukpairinjL, axiom, (setukpairinjL<=>![X3:$i, X4:$i, X5:$i, X6:$i]:((kpair @ X3 @ X4)=(kpair @ X5 @ X6)=>(X3)=(X5))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', setukpairinjL)).
0.39/0.61	thf(setukpairinjR, axiom, (setukpairinjR<=>![X3:$i, X4:$i, X5:$i, X6:$i]:((kpair @ X3 @ X4)=(kpair @ X5 @ X6)=>(X4)=(X6))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', setukpairinjR)).
0.39/0.61	thf(dpsetconstr, axiom, (dpsetconstr)=(^[X1:$i, X7:$i, X8:$i > $i > $o]:dsetconstr @ (cartprod @ X1 @ X7) @ (^[X6:$i]:?[X3:$i]:(in @ X3 @ X1&?[X4:$i]:((in @ X4 @ X7&X8 @ X3 @ X4)&(X6)=(kpair @ X3 @ X4))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', dpsetconstr)).
0.39/0.61	thf(c_0_5, plain, ![X4:$i, X2:$i > $o]:(epred3_2 @ X2 @ X4<=>X2 @ X4), introduced(definition)).
0.39/0.61	thf(c_0_6, plain, ![X6:$i, X5:$i, X9:$i > $i > $o]:(epred2_3 @ X9 @ X5 @ X6<=>X9 @ X5 @ X6), introduced(definition)).
0.39/0.61	thf(c_0_7, plain, ![X26:$i, X1:$i, X7:$i, X8:$i > $i > $o]:(epred1_4 @ X8 @ X7 @ X1 @ X26<=>?[X27:$i]:(in @ X27 @ X1&?[X28:$i]:((in @ X28 @ X7&X8 @ X27 @ X28)&(X26)=(kpair @ X27 @ X28)))), introduced(definition)).
0.39/0.61	thf(c_0_8, negated_conjecture, ~((![X1:$i, X2:$i > $o, X3:$i]:(in @ X3 @ (dsetconstr @ X1 @ (epred3_2 @ X2))=>X2 @ X3)=>(![X3:$i, X4:$i, X5:$i, X6:$i]:((kpair @ X3 @ X4)=(kpair @ X5 @ X6)=>(X3)=(X5))=>(![X3:$i, X4:$i, X5:$i, X6:$i]:((kpair @ X3 @ X4)=(kpair @ X5 @ X6)=>(X4)=(X6))=>![X1:$i, X7:$i, X9:$i > $i > $o, X3:$i]:(in @ X3 @ X1=>![X4:$i]:(in @ X4 @ X7=>(in @ (kpair @ X3 @ X4) @ (dpsetconstr @ X1 @ X7 @ (epred2_3 @ X9))=>X9 @ X3 @ X4))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[dpsetconstrERa]), dsetconstrER]), setukpairinjL]), setukpairinjR]), c_0_5]), c_0_6])])).
0.39/0.61	thf(c_0_9, plain, ![X1:$i, X7:$i, X8:$i > $i > $o]:(dpsetconstr @ X1 @ X7 @ X8)=(dsetconstr @ (cartprod @ X1 @ X7) @ (epred1_4 @ X8 @ X7 @ X1)), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[dpsetconstr]), c_0_7])).
0.39/0.61	thf(c_0_10, negated_conjecture, ![X32:$i, X33:$i > $o, X34:$i, X35:$i, X36:$i, X37:$i, X38:$i, X39:$i, X40:$i, X41:$i, X42:$i]:((~in @ X34 @ (dsetconstr @ X32 @ (epred3_2 @ X33))|X33 @ X34)&(((kpair @ X35 @ X36)!=(kpair @ X37 @ X38)|(X35)=(X37))&(((kpair @ X39 @ X40)!=(kpair @ X41 @ X42)|(X40)=(X42))&(in @ esk3_0 @ esk1_0&(in @ esk4_0 @ esk2_0&(in @ (kpair @ esk3_0 @ esk4_0) @ (dpsetconstr @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0))&~epred4_0 @ esk3_0 @ esk4_0)))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])).
0.39/0.61	thf(c_0_11, plain, ![X29:$i, X30:$i, X31:$i > $i > $o]:(dpsetconstr @ X29 @ X30 @ X31)=(dsetconstr @ (cartprod @ X29 @ X30) @ (epred1_4 @ X31 @ X30 @ X29)), inference(variable_rename,[status(thm)],[c_0_9])).
0.39/0.61	thf(c_0_12, negated_conjecture, ![X1:$i, X3:$i, X2:$i > $o]:(X2 @ X1|~in @ X1 @ (dsetconstr @ X3 @ (epred3_2 @ X2))), inference(split_conjunct,[status(thm)],[c_0_10])).
0.39/0.61	thf(c_0_13, plain, ![X8:$i > $i > $o, X3:$i, X1:$i]:(dpsetconstr @ X1 @ X3 @ X8)=(dsetconstr @ (cartprod @ X1 @ X3) @ (epred1_4 @ X8 @ X3 @ X1)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.39/0.61	thf(c_0_14, plain, ![X1:$i, X2:$i > $o, X3:$i, X4:$i, X8:$i > $i > $o]:(X2 @ X1|(epred1_4 @ X8 @ X3 @ X4)!=(epred3_2 @ X2)|~in @ X1 @ (dpsetconstr @ X4 @ X3 @ X8)), inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_12, c_0_13])])).
0.39/0.61	thf(c_0_15, negated_conjecture, in @ (kpair @ esk3_0 @ esk4_0) @ (dpsetconstr @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0)), inference(split_conjunct,[status(thm)],[c_0_10])).
0.39/0.61	thf(c_0_16, negated_conjecture, ![X2:$i > $o]:(X2 @ (kpair @ esk3_0 @ esk4_0)|(epred1_4 @ (epred2_3 @ epred4_0) @ esk2_0 @ esk1_0)!=(epred3_2 @ X2)), inference(spm,[status(thm)],[c_0_14, c_0_15])).
0.39/0.61	thf(c_0_17, plain, ![X63:$i, X64:$i > $o]:((~epred3_2 @ X64 @ X63|X64 @ X63)&(~X64 @ X63|epred3_2 @ X64 @ X63)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])).
0.39/0.61	thf(c_0_18, negated_conjecture, ![X2:$i > $o]:(X2 @ (kpair @ esk3_0 @ esk4_0)|(epred1_4 @ (epred2_3 @ epred4_0) @ esk2_0 @ esk1_0 @ (esk11_1 @ X2))!=(epred3_2 @ X2 @ (esk11_1 @ X2))), inference(neg_ext,[status(thm)],[c_0_16])).
0.39/0.61	thf(c_0_19, plain, ![X2:$i > $o, X1:$i]:(X2 @ X1|~epred3_2 @ X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_17])).
0.39/0.61	thf(c_0_20, negated_conjecture, ![X2:$i > $o]:(epred1_4 @ (epred2_3 @ epred4_0) @ esk2_0 @ esk1_0 @ (esk11_1 @ X2)|X2 @ (kpair @ esk3_0 @ esk4_0)|epred3_2 @ X2 @ (esk11_1 @ X2)), inference(dynamic cnf,[status(thm)],[c_0_18])).
0.39/0.61	thf(c_0_21, plain, ![X2:$i > $o]:(epred1_4 @ (epred2_3 @ epred4_0) @ esk2_0 @ esk1_0 @ (esk11_1 @ X2)|X2 @ (kpair @ esk3_0 @ esk4_0)|X2 @ (esk11_1 @ X2)), inference(spm,[status(thm)],[c_0_19, c_0_20])).
0.39/0.61	thf(c_0_22, plain, ![X2:$i > $o, X1:$i]:(epred3_2 @ X2 @ X1|~X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_17])).
0.39/0.61	thf(c_0_23, plain, (epred1_4 @ (epred2_3 @ epred4_0) @ esk2_0 @ esk1_0 @ (esk11_1 @ (epred1_4 @ (epred2_3 @ epred4_0) @ esk2_0 @ esk1_0))|epred1_4 @ (epred2_3 @ epred4_0) @ esk2_0 @ esk1_0 @ (kpair @ esk3_0 @ esk4_0)), inference(ef,[status(thm)],[c_0_21])).
0.39/0.61	thf(c_0_24, plain, ![X48:$i, X49:$i, X50:$i, X51:$i > $i > $o, X54:$i, X55:$i, X56:$i, X57:$i > $i > $o, X58:$i, X59:$i]:(((in @ (esk5_4 @ X48 @ X49 @ X50 @ X51) @ X49|~epred1_4 @ X51 @ X50 @ X49 @ X48)&(((in @ (esk6_4 @ X48 @ X49 @ X50 @ X51) @ X50|~epred1_4 @ X51 @ X50 @ X49 @ X48)&(X51 @ (esk5_4 @ X48 @ X49 @ X50 @ X51) @ (esk6_4 @ X48 @ X49 @ X50 @ X51)|~epred1_4 @ X51 @ X50 @ X49 @ X48))&((X48)=(kpair @ (esk5_4 @ X48 @ X49 @ X50 @ X51) @ (esk6_4 @ X48 @ X49 @ X50 @ X51))|~epred1_4 @ X51 @ X50 @ X49 @ X48)))&(~in @ X58 @ X55|(~in @ X59 @ X56|~X57 @ X58 @ X59|(X54)!=(kpair @ X58 @ X59))|epred1_4 @ X57 @ X56 @ X55 @ X54)), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])])).
0.39/0.61	thf(c_0_25, negated_conjecture, ![X2:$i > $o]:(X2 @ (kpair @ esk3_0 @ esk4_0)|~epred1_4 @ (epred2_3 @ epred4_0) @ esk2_0 @ esk1_0 @ (esk11_1 @ X2)|~epred3_2 @ X2 @ (esk11_1 @ X2)), inference(dynamic cnf,[status(thm)],[c_0_18])).
0.39/0.61	thf(c_0_26, plain, (epred3_2 @ (epred1_4 @ (epred2_3 @ epred4_0) @ esk2_0 @ esk1_0) @ (esk11_1 @ (epred1_4 @ (epred2_3 @ epred4_0) @ esk2_0 @ esk1_0))|epred1_4 @ (epred2_3 @ epred4_0) @ esk2_0 @ esk1_0 @ (kpair @ esk3_0 @ esk4_0)), inference(spm,[status(thm)],[c_0_22, c_0_23])).
0.39/0.61	thf(c_0_27, plain, ![X8:$i > $i > $o, X4:$i, X3:$i, X1:$i]:((X1)=(kpair @ (esk5_4 @ X1 @ X3 @ X4 @ X8) @ (esk6_4 @ X1 @ X3 @ X4 @ X8))|~epred1_4 @ X8 @ X4 @ X3 @ X1), inference(split_conjunct,[status(thm)],[c_0_24])).
0.39/0.61	thf(c_0_28, negated_conjecture, epred1_4 @ (epred2_3 @ epred4_0) @ esk2_0 @ esk1_0 @ (kpair @ esk3_0 @ esk4_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_23]), c_0_26])).
0.39/0.61	thf(c_0_29, negated_conjecture, ![X1:$i, X3:$i, X4:$i, X5:$i]:((X3)=(X5)|(kpair @ X1 @ X3)!=(kpair @ X4 @ X5)), inference(split_conjunct,[status(thm)],[c_0_10])).
0.39/0.61	thf(c_0_30, plain, (kpair @ (esk5_4 @ (kpair @ esk3_0 @ esk4_0) @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0)) @ (esk6_4 @ (kpair @ esk3_0 @ esk4_0) @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0)))=(kpair @ esk3_0 @ esk4_0), inference(spm,[status(thm)],[c_0_27, c_0_28])).
0.39/0.61	thf(c_0_31, negated_conjecture, ![X3:$i, X1:$i]:((esk6_4 @ (kpair @ esk3_0 @ esk4_0) @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0))=(X1)|(kpair @ esk3_0 @ esk4_0)!=(kpair @ X3 @ X1)), inference(spm,[status(thm)],[c_0_29, c_0_30])).
0.39/0.61	thf(c_0_32, plain, ![X60:$i, X61:$i, X62:$i > $i > $o]:((~epred2_3 @ X62 @ X61 @ X60|X62 @ X61 @ X60)&(~X62 @ X61 @ X60|epred2_3 @ X62 @ X61 @ X60)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])).
0.39/0.61	thf(c_0_33, plain, ![X8:$i > $i > $o, X4:$i, X3:$i, X1:$i]:(X8 @ (esk5_4 @ X1 @ X3 @ X4 @ X8) @ (esk6_4 @ X1 @ X3 @ X4 @ X8)|~epred1_4 @ X8 @ X4 @ X3 @ X1), inference(split_conjunct,[status(thm)],[c_0_24])).
0.39/0.61	thf(c_0_34, negated_conjecture, (esk6_4 @ (kpair @ esk3_0 @ esk4_0) @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0))=(esk4_0), inference(er,[status(thm)],[c_0_31])).
0.39/0.61	thf(c_0_35, plain, ![X1:$i, X8:$i > $i > $o, X3:$i]:(X8 @ X1 @ X3|~epred2_3 @ X8 @ X1 @ X3), inference(split_conjunct,[status(thm)],[c_0_32])).
0.39/0.61	thf(c_0_36, plain, epred2_3 @ epred4_0 @ (esk5_4 @ (kpair @ esk3_0 @ esk4_0) @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0)) @ (esk6_4 @ (kpair @ esk3_0 @ esk4_0) @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0)), inference(spm,[status(thm)],[c_0_33, c_0_28])).
0.39/0.61	thf(c_0_37, negated_conjecture, ![X1:$i, X3:$i, X4:$i, X5:$i]:((X1)=(X4)|(kpair @ X1 @ X3)!=(kpair @ X4 @ X5)), inference(split_conjunct,[status(thm)],[c_0_10])).
0.39/0.61	thf(c_0_38, plain, (kpair @ (esk5_4 @ (kpair @ esk3_0 @ esk4_0) @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0)) @ esk4_0)=(kpair @ esk3_0 @ esk4_0), inference(rw,[status(thm)],[c_0_30, c_0_34])).
0.39/0.61	thf(c_0_39, plain, epred4_0 @ (esk5_4 @ (kpair @ esk3_0 @ esk4_0) @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0)) @ (esk6_4 @ (kpair @ esk3_0 @ esk4_0) @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0)), inference(spm,[status(thm)],[c_0_35, c_0_36])).
0.39/0.61	thf(c_0_40, negated_conjecture, ![X1:$i, X3:$i]:((esk5_4 @ (kpair @ esk3_0 @ esk4_0) @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0))=(X1)|(kpair @ esk3_0 @ esk4_0)!=(kpair @ X1 @ X3)), inference(spm,[status(thm)],[c_0_37, c_0_38])).
0.39/0.61	thf(c_0_41, plain, epred4_0 @ (esk5_4 @ (kpair @ esk3_0 @ esk4_0) @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0)) @ esk4_0, inference(rw,[status(thm)],[c_0_39, c_0_34])).
0.39/0.61	thf(c_0_42, negated_conjecture, (esk5_4 @ (kpair @ esk3_0 @ esk4_0) @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0))=(esk3_0), inference(er,[status(thm)],[c_0_40])).
0.39/0.61	thf(c_0_43, negated_conjecture, ~epred4_0 @ esk3_0 @ esk4_0, inference(split_conjunct,[status(thm)],[c_0_10])).
0.39/0.61	thf(c_0_44, plain, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_41, c_0_42]), c_0_43]), ['proof']).
0.39/0.61	# SZS output end CNFRefutation
0.39/0.61	# Proof object total steps             : 45
0.39/0.61	# Proof object clause steps            : 30
0.39/0.61	# Proof object formula steps           : 15
0.39/0.61	# Proof object conjectures             : 17
0.39/0.61	# Proof object clause conjectures      : 14
0.39/0.61	# Proof object formula conjectures     : 3
0.39/0.61	# Proof object initial clauses used    : 11
0.39/0.61	# Proof object initial formulas used   : 5
0.39/0.61	# Proof object generating inferences   : 12
0.39/0.61	# Proof object simplifying inferences  : 6
0.39/0.61	# Training examples: 0 positive, 0 negative
0.39/0.61	# Parsed axioms                        : 13
0.39/0.61	# Removed by relevancy pruning/SinE    : 0
0.39/0.61	# Initial clauses                      : 25
0.39/0.61	# Removed in clause preprocessing      : 8
0.39/0.61	# Initial clauses in saturation        : 17
0.39/0.61	# Processed clauses                    : 574
0.39/0.61	# ...of these trivial                  : 1
0.39/0.61	# ...subsumed                          : 46
0.39/0.61	# ...remaining for further processing  : 527
0.39/0.61	# Other redundant clauses eliminated   : 38
0.39/0.61	# Clauses deleted for lack of memory   : 0
0.39/0.61	# Backward-subsumed                    : 0
0.39/0.61	# Backward-rewritten                   : 50
0.39/0.61	# Generated clauses                    : 9009
0.39/0.61	# ...of the previous two non-trivial   : 8692
0.39/0.61	# Contextual simplify-reflections      : 1
0.39/0.61	# Paramodulations                      : 8630
0.39/0.61	# Factorizations                       : 4
0.39/0.61	# NegExts                              : 174
0.39/0.61	# Equation resolutions                 : 46
0.39/0.61	# Propositional unsat checks           : 0
0.39/0.61	#    Propositional check models        : 0
0.39/0.61	#    Propositional check unsatisfiable : 0
0.39/0.61	#    Propositional clauses             : 0
0.39/0.61	#    Propositional clauses after purity: 0
0.39/0.61	#    Propositional unsat core size     : 0
0.39/0.61	#    Propositional preprocessing time  : 0.000
0.39/0.61	#    Propositional encoding time       : 0.000
0.39/0.61	#    Propositional solver time         : 0.000
0.39/0.61	#    Success case prop preproc time    : 0.000
0.39/0.61	#    Success case prop encoding time   : 0.000
0.39/0.61	#    Success case prop solver time     : 0.000
0.39/0.61	# Current number of processed clauses  : 446
0.39/0.61	#    Positive orientable unit clauses  : 115
0.39/0.61	#    Positive unorientable unit clauses: 0
0.39/0.61	#    Negative unit clauses             : 1
0.39/0.61	#    Non-unit-clauses                  : 330
0.39/0.61	# Current number of unprocessed clauses: 8119
0.39/0.61	# ...number of literals in the above   : 33683
0.39/0.61	# Current number of archived formulas  : 0
0.39/0.61	# Current number of archived clauses   : 80
0.39/0.61	# Clause-clause subsumption calls (NU) : 22059
0.39/0.61	# Rec. Clause-clause subsumption calls : 16011
0.39/0.61	# Non-unit clause-clause subsumptions  : 47
0.39/0.61	# Unit Clause-clause subsumption calls : 924
0.39/0.61	# Rewrite failures with RHS unbound    : 0
0.39/0.61	# BW rewrite match attempts            : 2091
0.39/0.61	# BW rewrite match successes           : 3
0.39/0.61	# Condensation attempts                : 0
0.39/0.61	# Condensation successes               : 0
0.39/0.61	# Termbank termtop insertions          : 198677
0.39/0.61	
0.39/0.61	# -------------------------------------------------
0.39/0.61	# User time                : 0.235 s
0.39/0.61	# System time              : 0.012 s
0.39/0.61	# Total time               : 0.248 s
0.39/0.61	# Maximum resident set size: 1660 pages
0.39/0.61	EOF